Serveur d'exploration Bourbaki

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Univariate polynomial factorization over finite fields

Identifieur interne : 000432 ( France/Analysis ); précédent : 000431; suivant : 000433

Univariate polynomial factorization over finite fields

Auteurs : Patrice Naudin [France] ; Claude Quitté [France]

Source :

RBID : ISTEX:432BB8EF5CC63D64648BAB7F65CE8142E78A923F

English descriptors

Abstract

Abstract: This paper is a tutorial introduction to univariate polynomial factorization over finite fields. We recall the classical methods that induced most factorization algorithms (Berlekamp's and the Cantor-Zassenhaus ones) and some refinements which can be applied to these methods. Explicit algorithms are presented in a form suitable for almost immediate implementation. We give a detailed description of an efficient implementation of the Cantor-Zassenhaus algorithm used in the release 2 of the Axiom computer algebra system.

Url:
DOI: 10.1016/S0304-3975(97)80001-1


Affiliations:


Links toward previous steps (curation, corpus...)


Links to Exploration step

ISTEX:432BB8EF5CC63D64648BAB7F65CE8142E78A923F

Le document en format XML

<record>
<TEI wicri:istexFullTextTei="biblStruct">
<teiHeader>
<fileDesc>
<titleStmt>
<title>Univariate polynomial factorization over finite fields</title>
<author>
<name sortKey="Naudin, Patrice" sort="Naudin, Patrice" uniqKey="Naudin P" first="Patrice" last="Naudin">Patrice Naudin</name>
</author>
<author>
<name sortKey="Quitte, Claude" sort="Quitte, Claude" uniqKey="Quitte C" first="Claude" last="Quitté">Claude Quitté</name>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:432BB8EF5CC63D64648BAB7F65CE8142E78A923F</idno>
<date when="1998" year="1998">1998</date>
<idno type="doi">10.1016/S0304-3975(97)80001-1</idno>
<idno type="url">https://api.istex.fr/document/432BB8EF5CC63D64648BAB7F65CE8142E78A923F/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000D67</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000D67</idno>
<idno type="wicri:Area/Istex/Curation">000D67</idno>
<idno type="wicri:Area/Istex/Checkpoint">001479</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001479</idno>
<idno type="wicri:doubleKey">0304-3975:1998:Naudin P:univariate:polynomial:factorization</idno>
<idno type="wicri:Area/Main/Merge">001640</idno>
<idno type="wicri:Area/Main/Curation">001622</idno>
<idno type="wicri:Area/Main/Exploration">001622</idno>
<idno type="wicri:Area/France/Extraction">000432</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title level="a">Univariate polynomial factorization over finite fields</title>
<author>
<name sortKey="Naudin, Patrice" sort="Naudin, Patrice" uniqKey="Naudin P" first="Patrice" last="Naudin">Patrice Naudin</name>
<affiliation wicri:level="4">
<country xml:lang="fr">France</country>
<wicri:regionArea>Laboratoire de mathématiques, ESA 6086, Groupes de Lie et Géométrie, Université de Poitiers, 40, Avenue du Recteur Pineau, F-86022 Poitiers Cedex</wicri:regionArea>
<placeName>
<region type="region" nuts="2">Nouvelle-Aquitaine</region>
<region type="old region" nuts="2">Poitou-Charentes</region>
<settlement type="city">Poitiers</settlement>
<settlement type="city">Poitiers</settlement>
</placeName>
<orgName type="university">Université de Poitiers</orgName>
</affiliation>
<affiliation wicri:level="1">
<country wicri:rule="url">France</country>
</affiliation>
</author>
<author>
<name sortKey="Quitte, Claude" sort="Quitte, Claude" uniqKey="Quitte C" first="Claude" last="Quitté">Claude Quitté</name>
<affiliation wicri:level="4">
<country xml:lang="fr">France</country>
<wicri:regionArea>Laboratoire de mathématiques, ESA 6086, Groupes de Lie et Géométrie, Université de Poitiers, 40, Avenue du Recteur Pineau, F-86022 Poitiers Cedex</wicri:regionArea>
<orgName type="university">Université de Poitiers</orgName>
<placeName>
<settlement type="city">Poitiers</settlement>
<region type="region" nuts="2">Poitou-Charentes</region>
</placeName>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series>
<title level="j">Theoretical Computer Science</title>
<title level="j" type="abbrev">TCS</title>
<idno type="ISSN">0304-3975</idno>
<imprint>
<publisher>ELSEVIER</publisher>
<date type="published" when="1998">1998</date>
<biblScope unit="volume">191</biblScope>
<biblScope unit="issue">1–2</biblScope>
<biblScope unit="page" from="1">1</biblScope>
<biblScope unit="page" to="36">36</biblScope>
</imprint>
<idno type="ISSN">0304-3975</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt>
<idno type="ISSN">0304-3975</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="KwdEn" xml:lang="en">
<term>Algebra</term>
<term>Algebraic</term>
<term>Algorithm</term>
<term>Amer</term>
<term>Appl</term>
<term>Axiom</term>
<term>Axiom computer algebra system</term>
<term>Base field</term>
<term>Berlekamp</term>
<term>Camion</term>
<term>Cardinality</term>
<term>Chinese components</term>
<term>Chinese isomorphism</term>
<term>Classical methods</term>
<term>Coding theory</term>
<term>Comm</term>
<term>Comput</term>
<term>Computer algebra</term>
<term>Computer algebra system</term>
<term>Computer science</term>
<term>Constant time</term>
<term>Corps fini</term>
<term>Cyclic group</term>
<term>Deterministic algorithm</term>
<term>Deterministic algorithms</term>
<term>Direct product</term>
<term>Discrete math</term>
<term>Distinct degree factorization</term>
<term>Divisor</term>
<term>Exponentiation</term>
<term>Factoring</term>
<term>Factoring algorithm</term>
<term>Factoring polynomials</term>
<term>Factoring subset</term>
<term>Factorization</term>
<term>Factorization algorithm</term>
<term>Factorization algorithms</term>
<term>Factorization input</term>
<term>Factorization process</term>
<term>Factorizing polynomials</term>
<term>Field operations</term>
<term>Finite</term>
<term>Finite extension</term>
<term>Finite field</term>
<term>Finite fields</term>
<term>Frobenius</term>
<term>Frobenius automorphism</term>
<term>Frobenius maps</term>
<term>Galois</term>
<term>Graduate texts</term>
<term>Idempotents</term>
<term>Ieee</term>
<term>Ieee press</term>
<term>Ieee trans</term>
<term>Initial polynomial</term>
<term>Irreducible</term>
<term>Irreducible factors</term>
<term>Irreducible polynomials</term>
<term>Isomorphism</term>
<term>Iteration</term>
<term>Kaltofen</term>
<term>Last step</term>
<term>Lecture notes</term>
<term>Main loop</term>
<term>Math</term>
<term>Mignotte</term>
<term>Minimal polynomial</term>
<term>Modulo</term>
<term>Multiplicative</term>
<term>Naudin</term>
<term>Niederreiter</term>
<term>Norm function</term>
<term>Norm functions</term>
<term>Number theory</term>
<term>Original polynomial</term>
<term>Polynomial</term>
<term>Polynomial factorization</term>
<term>Polynomial factorization algorithms</term>
<term>Previous algorithm</term>
<term>Prime field</term>
<term>Prime number</term>
<term>Primitive idempotents</term>
<term>Probabilistic</term>
<term>Probabilistic algorithm</term>
<term>Probabilistic algorithms</term>
<term>Proc</term>
<term>Proper factors</term>
<term>Quadratic</term>
<term>Random element</term>
<term>Random polynomial</term>
<term>Same degree</term>
<term>Shank</term>
<term>Sigsam bull</term>
<term>Springer</term>
<term>Square root</term>
<term>Square root algorithm</term>
<term>Square root operation</term>
<term>Subalgebra</term>
<term>Subgroup</term>
<term>Subset</term>
<term>Symbolic comput</term>
<term>Symp</term>
<term>Theoretical computer science</term>
<term>Trace function</term>
<term>Trans</term>
<term>Unique factorization domain</term>
</keywords>
<keywords scheme="Teeft" xml:lang="en">
<term>Algebra</term>
<term>Algebraic</term>
<term>Algorithm</term>
<term>Amer</term>
<term>Appl</term>
<term>Axiom</term>
<term>Axiom computer algebra system</term>
<term>Base field</term>
<term>Berlekamp</term>
<term>Camion</term>
<term>Cardinality</term>
<term>Chinese components</term>
<term>Chinese isomorphism</term>
<term>Classical methods</term>
<term>Coding theory</term>
<term>Comm</term>
<term>Comput</term>
<term>Computer algebra</term>
<term>Computer algebra system</term>
<term>Computer science</term>
<term>Constant time</term>
<term>Corps fini</term>
<term>Cyclic group</term>
<term>Deterministic algorithm</term>
<term>Deterministic algorithms</term>
<term>Direct product</term>
<term>Discrete math</term>
<term>Distinct degree factorization</term>
<term>Divisor</term>
<term>Exponentiation</term>
<term>Factoring</term>
<term>Factoring algorithm</term>
<term>Factoring polynomials</term>
<term>Factoring subset</term>
<term>Factorization</term>
<term>Factorization algorithm</term>
<term>Factorization algorithms</term>
<term>Factorization input</term>
<term>Factorization process</term>
<term>Factorizing polynomials</term>
<term>Field operations</term>
<term>Finite</term>
<term>Finite extension</term>
<term>Finite field</term>
<term>Finite fields</term>
<term>Frobenius</term>
<term>Frobenius automorphism</term>
<term>Frobenius maps</term>
<term>Galois</term>
<term>Graduate texts</term>
<term>Idempotents</term>
<term>Ieee</term>
<term>Ieee press</term>
<term>Ieee trans</term>
<term>Initial polynomial</term>
<term>Irreducible</term>
<term>Irreducible factors</term>
<term>Irreducible polynomials</term>
<term>Isomorphism</term>
<term>Iteration</term>
<term>Kaltofen</term>
<term>Last step</term>
<term>Lecture notes</term>
<term>Main loop</term>
<term>Math</term>
<term>Mignotte</term>
<term>Minimal polynomial</term>
<term>Modulo</term>
<term>Multiplicative</term>
<term>Naudin</term>
<term>Niederreiter</term>
<term>Norm function</term>
<term>Norm functions</term>
<term>Number theory</term>
<term>Original polynomial</term>
<term>Polynomial</term>
<term>Polynomial factorization</term>
<term>Polynomial factorization algorithms</term>
<term>Previous algorithm</term>
<term>Prime field</term>
<term>Prime number</term>
<term>Primitive idempotents</term>
<term>Probabilistic</term>
<term>Probabilistic algorithm</term>
<term>Probabilistic algorithms</term>
<term>Proc</term>
<term>Proper factors</term>
<term>Quadratic</term>
<term>Random element</term>
<term>Random polynomial</term>
<term>Same degree</term>
<term>Shank</term>
<term>Sigsam bull</term>
<term>Springer</term>
<term>Square root</term>
<term>Square root algorithm</term>
<term>Square root operation</term>
<term>Subalgebra</term>
<term>Subgroup</term>
<term>Subset</term>
<term>Symbolic comput</term>
<term>Symp</term>
<term>Theoretical computer science</term>
<term>Trace function</term>
<term>Trans</term>
<term>Unique factorization domain</term>
</keywords>
</textClass>
<langUsage>
<language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">Abstract: This paper is a tutorial introduction to univariate polynomial factorization over finite fields. We recall the classical methods that induced most factorization algorithms (Berlekamp's and the Cantor-Zassenhaus ones) and some refinements which can be applied to these methods. Explicit algorithms are presented in a form suitable for almost immediate implementation. We give a detailed description of an efficient implementation of the Cantor-Zassenhaus algorithm used in the release 2 of the Axiom computer algebra system.</div>
</front>
</TEI>
<affiliations>
<list>
<country>
<li>France</li>
</country>
<region>
<li>Nouvelle-Aquitaine</li>
<li>Poitou-Charentes</li>
</region>
<settlement>
<li>Poitiers</li>
</settlement>
<orgName>
<li>Université de Poitiers</li>
</orgName>
</list>
<tree>
<country name="France">
<region name="Nouvelle-Aquitaine">
<name sortKey="Naudin, Patrice" sort="Naudin, Patrice" uniqKey="Naudin P" first="Patrice" last="Naudin">Patrice Naudin</name>
</region>
<name sortKey="Naudin, Patrice" sort="Naudin, Patrice" uniqKey="Naudin P" first="Patrice" last="Naudin">Patrice Naudin</name>
<name sortKey="Quitte, Claude" sort="Quitte, Claude" uniqKey="Quitte C" first="Claude" last="Quitté">Claude Quitté</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Mathematiques/explor/BourbakiV1/Data/France/Analysis
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000432 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/France/Analysis/biblio.hfd -nk 000432 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Mathematiques
   |area=    BourbakiV1
   |flux=    France
   |étape=   Analysis
   |type=    RBID
   |clé=     ISTEX:432BB8EF5CC63D64648BAB7F65CE8142E78A923F
   |texte=   Univariate polynomial factorization over finite fields
}}

Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Thu Jul 5 10:00:31 2018. Site generation: Sat Nov 19 17:42:07 2022